The tree equivalence of linear recursion schemes
نویسنده
چکیده
In the paper, a complete system of transformation rules preserving the tree equivalence and a polynomial-time algorithm deciding the tree equivalence of linear polyadic recursion schemes are proposed. The algorithm is formulated as a sequential transformation process which brings together the schemes in question. In the last step, the tree equivalence problem for the given schemes is reduced to a global ow analysis problem which is solved by an eecient marking algorithm.
منابع مشابه
A Representation of Trees by Languages I
A tree can be represented by a language consisting of a suitable coding of its finite branches. We investigate this representation and derive a number of reductions between certain equivalence problems for context-free tree grammars ~nd recursive program schemes and the (open) equivalence problem for DPDA's. This is the first ~zrt of th~s work: it is devoted to technical results on prefix-free ...
متن کاملBöhm Trees as Higher-Order Recursive Schemes
Higher-order recursive schemes (HORS) are schematic representations of functional programs. They generate possibly infinite ranked labelled trees and, in that respect, are known to be equivalent to a restricted fragment of the λY -calculus consisting of ground-type terms whose free variables have types of the form o→ ⋯→ o (with o being a special case). In this paper, we show that any λY -term (...
متن کاملEquivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes
In this paper we consider how certain properties of monadic recursion schemes are related to those of cteterministic context-free languages. Previous work showed only how to translate properties of schemes into properties of languages [3]. This was accomplished by a construction that when given any monadic recursion scheme S, produced a deterministic pushdown automaton (abbreviated dpda) accept...
متن کاملProgram Schemes, Recursion Schemes, and Formal Languages
This paper presents general methods for studying the problems of translatability between classes of schemes and equivalence of schemes in a given class. There are four methods: applying the theory of formal languages, programming, measuring the complexity of a computation, and "cutting and pasting." These methods are used to answer several questions of translatability and equivalence for classe...
متن کاملAutomata on Infinite Objects and Their Applications to Logic and Programming
We introduce various types of w-automata, top-down automata and bottom-up automata on infinite trees. We study the power of deterministic and nondeter-ministic tree automata and prove that deterministic and non-deterministic bottom-up tree automata accept the same intinite tree sets. We establish a relationship between tree automata, Logic programs, recursive program schemes, and the monadic se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 238 شماره
صفحات -
تاریخ انتشار 2000